Permissive nominal terms and their unification Gilles

نویسندگان

  • Gilles Dowek
  • Murdoch J. Gabbay
  • Dominic Mulligan
چکیده

We introduce permissive nominal terms. Nominal terms are one way to extend first-order terms with binding. They lack some properties of firstand higher-order terms: Terms must be reasoned on in a context of ‘freshness assumptions’; it is not always possible to ‘choose a fresh variable symbol’ for a nominal term; and it is not always possible to ‘alpha-convert a bound variable symbol’. Permissive nominal terms resemble nominal terms but recover these ‘always fresh’ and ‘always alpha-rename’ properties, familiar from firstand higher-order syntax. Freshness contexts are elided and the notion of unifier is based on substitution alone rather than on nominal terms’ notion of substitution plus freshness conditions. Expressivity is not lost moving to the permissive case.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques

Nominal terms extend first-order terms with binding. They lack some properties of firstand higher-order terms: Terms must be reasoned about in a context of ‘freshness assumptions’; it is not always possible to ‘choose a fresh variable symbol’ for a nominal term; it is not always possible to ‘α-convert a bound variable symbol’ or to ‘quotient by α-equivalence’; the notion of unifier is not based...

متن کامل

Permissive nominal terms and their unification

We introduce permissive nominal terms. Nominal terms extend first-order terms with binding. They lack properties of firstand higher-order terms: Terms must be reasoned on in a context of ‘freshness assumptions’; it is not always possible to ‘choose a fresh variable symbol’ for a nominal term; and it is not always possible to ‘alpha-convert a bound variable symbol’. Permissive nominal terms reco...

متن کامل

Permissive nominal terms

We present a simplified version of nominal terms with improved properties. Nominal terms are themselves a version of first-order terms, adapted to provide primitive support for names, binding, capturing substitution, and alpha-conversion. Nominal terms lack certain properties of first-order terms; it is always possible to ‘choose a fresh variable symbol’ for a first-order term and it is always ...

متن کامل

Nominal Anti-Unification

Equation solving between nominal terms has been investigated by several authors, who designed and analyzed algorithms for nominal unification [3, 4, 15, 26], nominal matching [5], equivariant unification [6], permissive nominal unification [8]. However, in contrast to unification, its dual problem, anti-unification, has not been studied for nominal terms previously. In [18], it is referred to a...

متن کامل

Relating Nominal and Higher-Order Pattern Unification

Higher-order pattern unification and nominal unification are two approaches to unifying modulo some form of α-equivalence (consistent renaming of bound names). Though the higher-order and nominal approaches superficially dissimilar, there is a natural concretion (or name-application) operation for nominal terms that can be used to simulate the behavior of higher-order patterns. We describe a fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009